A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
نویسندگان
چکیده
منابع مشابه
Solving Transient-stability Constrained Optimal Power Flow Problems
The paper extends our pervious work on solving multi-contingency transient stability constrained optimal power flow problems (MC-TSCOPF) with the approach of particles swarm optimization (PSO). A hybrid PSO method that incorporates with a new wavelet theory based mutation operation, intends to improve the searching strategies on previously used PSO methods, is proposed to solve MC-TSCOPF proble...
متن کاملTransient Stability Constrained Optimal Power Flow Using Evolutionary Programming
This paper presents an application of evolution programming (EP), which has no limitation on objective function, for transient stability constrained optimal power flow (TSCOPF) problem. Swing equation and limit of rotor angle deviation with respect to centre of inertia (COI) are treated as additional constraints in transient stability concern. The generator fuel cost minimization is selected as...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملA Modified Particle Swarm Optimization Technique for Solving Transient Stability Constrained Optimal Power Flow
This paper presents an improved Particle Swarm Optimization (PSO) algorithm for solving Transient Stability Constrained Optimal Power Flow (TSCOPF) problem through the application of Gaussian and Cauchy probability distributions. The modified PSO approach introduces new diversification and intensification strategy into the particles thus preventing PSO algorithm from premature convergence. The ...
متن کاملA parallel algorithm for semi-infinite programming
The implementation results of an algorithm designed to solve semi-in&nite programming problems are reported. Due to its computational intensity, parallelisation is used in two stages of the algorithm—for evaluating the global optimum and for checking the feasibility of constraints. The algorithms are parallelised using MPI—the message passing interface. The algorithms are then applied to engine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2007.02.026